Scalable Evolutionary Computation
نویسنده
چکیده
منابع مشابه
A Scalable and Robust Framework for Distributed Applications
This paper describes a novel tool for running distributed experiments on the Internet. The possible applications include simple load balancing, parallel evolutionary computation, agent-based simulation and artificial life. Our environment is based on cutting-edge peer-to-peer (P2P) technology. We demonstrate the potentials of the framework by analyzing a simple distributed multistart hillclimbe...
متن کاملDistributed BEAGLE: An Environment for Parallel and Distributed Evolutionary Computations
Evolutionary computation is a promising artificial intelligence field involving the simulation of natural evolution to solve problems. Given its implicit parallelism and high computational requirements, evolutionary computation is the perfect candidate for high performance parallel computers. This paper presents Distributed BEAGLE, a new master-slave architecture for parallel and distributed ev...
متن کاملDynamic configuration and collaborative scheduling in supply chains based on scalable multi-agent architecture
Due to diversified and frequently changing demands from customers, technological advances and global competition, manufacturers rely on collaboration with their business partners to share costs, risks and expertise. How to take advantage of advancement of technologies to effectively support operations and create competitive advantage is critical for manufacturers to survive. To respond to these...
متن کاملhGRGA: A scalable genetic algorithm using homologous gene schema replacement
In this article, we propose a new evolutionary algorithm, referred as homologous Gene Replacement Genetic Algorithm (hGRGA) that includes a novel and generic operator called homologous Gene Replacement (hGR). The hGR operator improves the chromosomes in gene level to promote their overall functionality. The hGRGA effectively encodes the key idea of the natural evolutionary process that locates ...
متن کاملPEAR: a massively parallel evolutionary computation approach for political redistricting optimization and analysis
Political redistricting, a well-known problem in political science and geographic information science, can be formulated as a combinatorial optimization problem, with objectives and constraints defined to meet legal requirements. The formulated optimization problem is NP-hard. We develop a scalable evolutionary computational approach utilizing massively parallel high performance computing for p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007